Metaheuristic global path planning algorithm for mobile robots

نویسندگان

  • Stojanche Panov
  • Saso Koceski
چکیده

A new metaheuristic method applied to the global path planning for mobile robots in dynamic environments is presented. This algorithm, named the Quad Harmony Search method, consists of dividing the robot‟s environment into free regions by applying the Quad-tree algorithm and utilizing this information to accelerate the next phase which implements the Harmony Search optimization method to provide the optimal route. The presented results have displayed that this method gives best results when compared to other metaheuristic techniques and is therefore applicable to the global path planning problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formation Control and Path Planning of Two Robots for Tracking a Moving Target

This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...

متن کامل

Effective Mechatronic Models and Methods for Implementation an Autonomous Soccer Robot

  Omni directional mobile robots have been popularly employed in several applications especially in soccer player robots considered in Robocup competitions. However, Omni directional navigation system, Omni-vision system and solenoid kicking mechanism in such mobile robots have not ever been combined. This situation brings the idea of a robot with no head direction into existence, a comprehensi...

متن کامل

Microsoft Word - 76_PE_07b_12_281-284_huang

This paper presents an FPGA-based (field-programmable gate array) hybrid metaheuristic GA (genetic algorithm)-PSO (particle swarm optimization) algorithm for mobile robots to find an optimal path between a starting and ending point in a grid environment. GA has been combined with PSO in evolving new solutions by applying crossover and mutation operators on solutions constructed by particles. Th...

متن کامل

A Novel Method for Path Planning of Mobile Robots via Fuzzy Logic and ant Colony Algorithem in Complex Daynamic Environments

Researches on mobile robot path planning with meta-heuristic methods to improve classical approaches have grown dramatically in the recent 35 years. Because routing is one of the NP-hard problems, an ant colony algorithm that is a metaheuristic method has had no table success in this area. In this paper, a new approach for solving mobile robot navigation in dynamic environments, based on the he...

متن کامل

GA-based Global Path Planning for Mobile Robot Employing A* Algorithm

Global path planning for mobile robot using genetic algorithm and A* algorithm is investigated in this paper. The proposed algorithm includes three steps: the MAKLINK graph theory is adopted to establish the free space model of mobile robots firstly, then Dijkstra algorithm is utilized for finding a feasible collision-free path, finally the global optimal path of mobile robots is obtained based...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJRIS

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2015